CV

Education

• Faculty of Information Technology, Czech Technical University (CTU), Prague, Czech Republic — Postdoc (2026– )
• Indian Institute of Science Education and Research (IISER) Pune, India — Ph.D. in Mathematics (2019–2025)
• Indian Institute of Science Education and Research (IISER) Pune, India — B.S.–M.S. Dual Degree (2014–2019)

Research Visits

• Institute of Mathematical Sciences (IMSc), Chennai, India
  Host: Prof. Saket Saurabh
  December 2023.

• Institute for Basic Science (IBS), Daejeon, South Korea
  Host: Dr. Roohani Sharma
  August 2025.

Journal Publications

• Ajinkya Gaikwad and Soumen Maity, Globally Minimal Defensive Alliances: A Parameterized Perspective, Discrete Applied Mathematics, (Accepted).
• Ajinkya Gaikwad, Soumen Maity and Shuvam Kant Tripathi, Parameterized Complexity of Locally Minimal Defensive Alliances, Discrete Applied Mathematics, (Accepted).
• Ajinkya Gaikwad and Soumen Maity, Structural Parameterizations of the Harmless Set Problem, Algorithmica, Vol. 86, 1475–1511, 2024.
• Ajinkya Gaikwad and Soumen Maity, Offensive Alliances in Graphs, Theoretical Computer Science, Vol. 989, 114401, 2024.
• Ajinkya Gaikwad and Soumen Maity, Defensive Alliances in Graphs, Theoretical Computer Science, Vol. 928, 136–150, 2022.
• Ajinkya Gaikwad and Soumen Maity, Further parameterized algorithms for the F-free edge deletion problem, Theoretical Computer Science, Vol. 933, 125–137, 2022.
• Ajinkya Gaikwad, Soumen Maity and Shuvam Kant Tripathi, Parameterized Complexity of Satisfactory Partition Problem, Theoretical Computer Science, Vol. 907, 113–127, 2022.
• Ajinkya Gaikwad and Soumen Maity, Globally Minimal Defensive Alliances, Information Processing Letters, Vol. 177, 106253, 2022.

Conference Publications

• Ajinkya Gaikwad, Hitendra Kumar and Soumen Maity, Parameterized Algorithms for Editing to Uniform Cluster Graph, FCT 2025.
• Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Saket Saurabh and Roohani Sharma, MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle Transversal, STACS 2025.
• Ajinkya Gaikwad and Soumen Maity, Parameterized complexity of the Th+1-Free Edge Deletion Problem, FCT 2023, LNCS Vol. 14292, 221–233, 2023.
• Ajinkya Gaikwad and Soumen Maity, On the Harmless Set Problem Parameterized by Treewidth, WALCOM 2022, LNCS Vol. 13174, 227–238, 2022.
• Ajinkya Gaikwad, Soumen Maity and Shuvam Kant Tripathi, Parameterized intractability of defensive alliance problem, CALDAM 2022, LNCS Vol. 13179, 279–291, 2022.
• Ajinkya Gaikwad and Soumen Maity, On Structural Parameterizations of the Offensive Alliance Problem, COCOA 2021, LNCS Vol. 13135, 579–586, 2021.
• Ajinkya Gaikwad, Soumen Maity and Shuvam Kant Tripathi, The Balanced Satisfactory Partition Problem, SOFSEM 2021, LNCS Vol. 12607, 322–336, 2021.
• Ajinkya Gaikwad, Soumen Maity and Shuvam Kant Tripathi, Parameterized Complexity of Locally Minimal Defensive Alliance, CALDAM 2021, LNCS Vol. 12601, 135–148, 2021.
• Ajinkya Gaikwad, Soumen Maity and Shuvam Kant Tripathi, Parameterized Complexity of Defensive and Offensive Alliances in Graphs, ICDCIT 2021, LNCS Vol. 12582, 175–187, 2021.
• Ajinkya Gaikwad, Soumen Maity and Shuvam Kant Tripathi, Parameterized Complexity of Satisfactory Partition Problem, COCOA 2020, LNCS Vol. 12577, 76–90, 2020.

Preprints

• Ajinkya Gaikwad, Hitendra Kumar, S. Padmapriya, Praneet Kumar Patra, Harsh Sanklecha, Soumen Maity, Inclusive and Exclusive Vertex Splitting into Specific Graph Classes: NP Hardness and Algorithms.
  arXiv:2510.26938
• Ajinkya Gaikwad, Parameterized Complexity of s-Club Cluster Edge Deletion: When Is the Diameter Bound Necessary?
  arXiv:2510.07065

Talks

• MaxMin Separation Problems: FPT Algorithms for $s$–$t$ Separator and Odd Cycle Transversal
  Symposium on Theoretical Aspects of Computer Science (STACS 2025),
  Jena, Germany, March 2025.
  Conference Talk.

• When Is $\mathcal{T}_{h+1}$-Free Edge Deletion Fixed-Parameter Tractable? Hardness and Approximation
  Indo-European Conference on Algorithms and Graph Theory,
  Indian Institute of Science Education and Research (IISER), Pune, India, January 2026.
  Symposium Talk.

Professional Services

Reviewed research papers for Discrete Applied Mathematics, Algorithmica, Theoretical Computer Science, and conferences such as MFCS, IWOCA, etc.

Teaching

• Teaching Assistant: Linear Algebra, Pune University (Fall 2024); Graph Theory, NPTEL (Spring 2024), IISER Pune (Spring & Fall 2021); Graph Theoretic Algorithms and Combinatorics, Ferguson College (Fall 2023, Fall 2022, Spring 2022, Spring & Summer 2021).
• Lecturer: Ramsey Theory, Pune University (Spring 2024); Combinatorics, Ferguson College (Fall 2023).

Fellowships and Awards

• Best PhD Thesis Award, Department of Mathematics, IISER Pune (2025)
• Prime Minister’s Research Fellowship (Sep 2020 – Oct 2024)
• CSIR NET fellowship (Aug 2019 – Aug 2020)
• INSPIRE fellowship, DST Govt. of India (Aug 2014 – May 2019)
• AIR 133, GATE 2019 (Mathematics)
• AIR 69, NET 2018 (JRF eligible)

References

• Prof. Saket Saurabh, The Institute of Mathematical Sciences, Chennai, India — saket@imsc.res.in
• Prof. Soumen Maity, IISER Pune, India — soumen@iiserpune.ac.in
• Dr. Roohani Sharma, Institute for Basic Science, South Korea — roohani.sharma90@gmail.com